Tracing index of rational curve parametrizations

نویسندگان

  • J. Rafael Sendra
  • Franz Winkler
چکیده

A rational parametrization of an algebraic curve establishes a rational correspondence of this curve with the affine or projective line. This correspondence is a birational equivalence if the parametrization is proper. So, intuitively speaking, a rational parametrization determines a linear tracing of the curve, when the parameter takes values in the algebraic closure of the ground field. Such a parametrization might trace the curve once or several times. We formally introduce the concept of the tracing index of a parametrization, we show how to compute it, and we relate it to the degree of rational reparametrizations as well as to the degree of the curve. In addition, we show how to apply these results to the case of real curves, where we introduce the notion of real tracing index.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computation of the singularities of parametric plane curves

Given an algebraic plane curve C defined by a rational parametrization P(t), we present formulae for the computation of the degree of C, and the multiplicity of a point. Using the results presented in [Sendra, J.R., Winkler, F., 2001. Tracing index of rational curve parametrizations. Computer Aided Geometric Design 18 (8), 771–795], the formulae simply involve the computation of the degree of a...

متن کامل

Advances in Algebraic Geometric Computation

Algebraic curves and surfaces play an important and ever increasing role in computer aided geometric design, computer vision, and computer aided manufacturing. Consequently, theoretical results need to be adapted to practical needs. We need efficient algorithms for generating, representing, manipulating, analyzing, rendering algebraic curves and surfaces. In the last years there has been dramat...

متن کامل

The Newton Polygon of a Rational Plane Curve

The Newton polygon of the implicit equation of a rational plane curve is explicitly determined by the multiplicities of any of its parametrizations. We give an intersection-theoretical proof of this fact based on a refinement of the KušnirenkoBernštein theorem. We apply this result to the determination of the Newton polygon of a curve parameterized by generic Laurent polynomials or by generic r...

متن کامل

Finding rational solutions of rational systems of autonomous ODEs

In this paper we provide an algorithm to find explicitly rational solutions of a rational system of autonomous ordinary differential equations (ODEs) from its invariant algebraic curves. The method is based on the rational parametrization of the rational invariant algebraic curves and intensively using of linear fractional transformations between two proper rational parametrizations of the same...

متن کامل

Algorithms for Rational Real Algebraic Curves

In this paper, we study fundamental properties of real curves, especially of rational real curves, and we derive several algorithms to decide the reality and rationality of curves in the complex plane. Furthermore, if the curve is real and rational, we determine a real parametrization. More precisely, we present a reality test algorithm for plane curves, and three different types of real parame...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Aided Geometric Design

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2001